Existing multi-hop clustered routing protocols for Intelligent Road Cone Ad-hoc Network （IRCAN） suffer from redundancy in network control overhead and the average number of hops for data packet transmission is not guaranteed to be minimal. To solve the above problems， combined with the link characteristics of the network topology， an efficient clustered routing protocol based on non-random retroverted clustering， called Retroverted-Clustering-based Hierarchy Routing （RCHR）， was proposed. Firstly， the retroverted clustering mechanism based on central extension and the cluster head selection algorithm based on overhearing， cross-layer sharing， and extending the adjacency matrix was proposed. Then， the proposed mechanism and the proposed algorithm were used to generate clusters with retroverted characteristics around sink nodes in sequence， and to select the optimal cluster heads for sink nodes at different directions without additional conditions. Thus， networking control overhead and time were decreased， and the formed network topology was profit for diminishing the average number of hops for data packet transmission. Theoretic analysis validated the effectiveness of the proposed protocol. The simulation experiment results show that compared with Ring-Based Multi-hop Clustering （RBMC） routing protocol and MODified Low Energy Adaptive Clustering Hierarchy （MOD-LEACH） protocol， the networking control overhead and the average number of hops for data packet transmission of the proposed protocol are reduced by 32.7% and 2.6% at least， respectively.

In the existing Dual LAN （Local Area Network） Terahertz Wireless LAN （Dual-LAN THz WLAN） related MAC （Medium Access Control） protocol， some nodes may repeatedly send the same Channel Time Request （CTRq） frame within multiple superframes to apply for time slot resources and idle time slots exist in some periods of network operation， therefore an efficient MAC protocol based on spontaneous data transmission SDTE-MAC （high-Efficiency MAC Protocol based on Spontaneous Data Transmission） was proposed. SDTE-MAC protocol enabled each node to maintain one or more time unit linked lists to synchronize with the rest of the nodes in the network running time， so as to know where each node started sending data frames at the channel idle time slot. The protocol optimized the traditional channel slot allocation and channel remaining slot reallocation processes， improved network throughput and channel slot utilization， reduced data delay， and could further improve the performance of Dual-LAN THz WLAN. The simulation results showed that when the network saturates， compared with the new N-CTAP （Normal Channel Time Allocation Period） slot resource allocation mechanism and adaptive shortening superframe period mechanism in the AHT-MAC （Adaptive High Throughout multi-pan MAC protocol）， the MAC layer throughput of the SDTE-MAC protocol was increased by 9.2%， the channel slot utilization was increased by 10.9%， and the data delay was reduced by 22.2%.

Wireless Sensor Network (WSN) adopts the default Distributed Address Assignment Mechanism (DAAM) of ZigBee technology to assign the addresses to the nodes without considering the optimization of the network topology, which causes the waste of network depth. In this paper, the authors proposed Distributed Borrowed Address Assignment (DBAA) algorithm to increase the success rate of joined nodes, which assigned the free addresses from 2-hops neighbors to the nodes for the optimization of the network topology. The theoretical analysis and simulation results show that DBAA algorithm outperforms both DAAM and Single Level Address Reorganization (SLAR) scheme in terms of the success rate of address assignment, communication overhead, and the average time of assigning addresses.